Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

rec1(rec1(x)) -> sent1(rec1(x))
rec1(sent1(x)) -> sent1(rec1(x))
rec1(no1(x)) -> sent1(rec1(x))
rec1(bot) -> up1(sent1(bot))
rec1(up1(x)) -> up1(rec1(x))
sent1(up1(x)) -> up1(sent1(x))
no1(up1(x)) -> up1(no1(x))
top1(rec1(up1(x))) -> top1(check1(rec1(x)))
top1(sent1(up1(x))) -> top1(check1(rec1(x)))
top1(no1(up1(x))) -> top1(check1(rec1(x)))
check1(up1(x)) -> up1(check1(x))
check1(sent1(x)) -> sent1(check1(x))
check1(rec1(x)) -> rec1(check1(x))
check1(no1(x)) -> no1(check1(x))
check1(no1(x)) -> no1(x)

Q is empty.


QTRS
  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

rec1(rec1(x)) -> sent1(rec1(x))
rec1(sent1(x)) -> sent1(rec1(x))
rec1(no1(x)) -> sent1(rec1(x))
rec1(bot) -> up1(sent1(bot))
rec1(up1(x)) -> up1(rec1(x))
sent1(up1(x)) -> up1(sent1(x))
no1(up1(x)) -> up1(no1(x))
top1(rec1(up1(x))) -> top1(check1(rec1(x)))
top1(sent1(up1(x))) -> top1(check1(rec1(x)))
top1(no1(up1(x))) -> top1(check1(rec1(x)))
check1(up1(x)) -> up1(check1(x))
check1(sent1(x)) -> sent1(check1(x))
check1(rec1(x)) -> rec1(check1(x))
check1(no1(x)) -> no1(check1(x))
check1(no1(x)) -> no1(x)

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

TOP1(rec1(up1(x))) -> REC1(x)
CHECK1(no1(x)) -> CHECK1(x)
REC1(bot) -> SENT1(bot)
REC1(rec1(x)) -> SENT1(rec1(x))
TOP1(sent1(up1(x))) -> CHECK1(rec1(x))
CHECK1(rec1(x)) -> CHECK1(x)
REC1(up1(x)) -> REC1(x)
TOP1(no1(up1(x))) -> REC1(x)
TOP1(sent1(up1(x))) -> TOP1(check1(rec1(x)))
REC1(no1(x)) -> SENT1(rec1(x))
CHECK1(sent1(x)) -> SENT1(check1(x))
CHECK1(rec1(x)) -> REC1(check1(x))
TOP1(no1(up1(x))) -> CHECK1(rec1(x))
CHECK1(no1(x)) -> NO1(check1(x))
REC1(sent1(x)) -> SENT1(rec1(x))
CHECK1(up1(x)) -> CHECK1(x)
TOP1(sent1(up1(x))) -> REC1(x)
TOP1(rec1(up1(x))) -> CHECK1(rec1(x))
TOP1(no1(up1(x))) -> TOP1(check1(rec1(x)))
REC1(no1(x)) -> REC1(x)
NO1(up1(x)) -> NO1(x)
SENT1(up1(x)) -> SENT1(x)
TOP1(rec1(up1(x))) -> TOP1(check1(rec1(x)))
REC1(sent1(x)) -> REC1(x)
CHECK1(sent1(x)) -> CHECK1(x)

The TRS R consists of the following rules:

rec1(rec1(x)) -> sent1(rec1(x))
rec1(sent1(x)) -> sent1(rec1(x))
rec1(no1(x)) -> sent1(rec1(x))
rec1(bot) -> up1(sent1(bot))
rec1(up1(x)) -> up1(rec1(x))
sent1(up1(x)) -> up1(sent1(x))
no1(up1(x)) -> up1(no1(x))
top1(rec1(up1(x))) -> top1(check1(rec1(x)))
top1(sent1(up1(x))) -> top1(check1(rec1(x)))
top1(no1(up1(x))) -> top1(check1(rec1(x)))
check1(up1(x)) -> up1(check1(x))
check1(sent1(x)) -> sent1(check1(x))
check1(rec1(x)) -> rec1(check1(x))
check1(no1(x)) -> no1(check1(x))
check1(no1(x)) -> no1(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
QDP
      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

TOP1(rec1(up1(x))) -> REC1(x)
CHECK1(no1(x)) -> CHECK1(x)
REC1(bot) -> SENT1(bot)
REC1(rec1(x)) -> SENT1(rec1(x))
TOP1(sent1(up1(x))) -> CHECK1(rec1(x))
CHECK1(rec1(x)) -> CHECK1(x)
REC1(up1(x)) -> REC1(x)
TOP1(no1(up1(x))) -> REC1(x)
TOP1(sent1(up1(x))) -> TOP1(check1(rec1(x)))
REC1(no1(x)) -> SENT1(rec1(x))
CHECK1(sent1(x)) -> SENT1(check1(x))
CHECK1(rec1(x)) -> REC1(check1(x))
TOP1(no1(up1(x))) -> CHECK1(rec1(x))
CHECK1(no1(x)) -> NO1(check1(x))
REC1(sent1(x)) -> SENT1(rec1(x))
CHECK1(up1(x)) -> CHECK1(x)
TOP1(sent1(up1(x))) -> REC1(x)
TOP1(rec1(up1(x))) -> CHECK1(rec1(x))
TOP1(no1(up1(x))) -> TOP1(check1(rec1(x)))
REC1(no1(x)) -> REC1(x)
NO1(up1(x)) -> NO1(x)
SENT1(up1(x)) -> SENT1(x)
TOP1(rec1(up1(x))) -> TOP1(check1(rec1(x)))
REC1(sent1(x)) -> REC1(x)
CHECK1(sent1(x)) -> CHECK1(x)

The TRS R consists of the following rules:

rec1(rec1(x)) -> sent1(rec1(x))
rec1(sent1(x)) -> sent1(rec1(x))
rec1(no1(x)) -> sent1(rec1(x))
rec1(bot) -> up1(sent1(bot))
rec1(up1(x)) -> up1(rec1(x))
sent1(up1(x)) -> up1(sent1(x))
no1(up1(x)) -> up1(no1(x))
top1(rec1(up1(x))) -> top1(check1(rec1(x)))
top1(sent1(up1(x))) -> top1(check1(rec1(x)))
top1(no1(up1(x))) -> top1(check1(rec1(x)))
check1(up1(x)) -> up1(check1(x))
check1(sent1(x)) -> sent1(check1(x))
check1(rec1(x)) -> rec1(check1(x))
check1(no1(x)) -> no1(check1(x))
check1(no1(x)) -> no1(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 5 SCCs with 13 less nodes.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
QDP
            ↳ QDPOrderProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

NO1(up1(x)) -> NO1(x)

The TRS R consists of the following rules:

rec1(rec1(x)) -> sent1(rec1(x))
rec1(sent1(x)) -> sent1(rec1(x))
rec1(no1(x)) -> sent1(rec1(x))
rec1(bot) -> up1(sent1(bot))
rec1(up1(x)) -> up1(rec1(x))
sent1(up1(x)) -> up1(sent1(x))
no1(up1(x)) -> up1(no1(x))
top1(rec1(up1(x))) -> top1(check1(rec1(x)))
top1(sent1(up1(x))) -> top1(check1(rec1(x)))
top1(no1(up1(x))) -> top1(check1(rec1(x)))
check1(up1(x)) -> up1(check1(x))
check1(sent1(x)) -> sent1(check1(x))
check1(rec1(x)) -> rec1(check1(x))
check1(no1(x)) -> no1(check1(x))
check1(no1(x)) -> no1(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be strictly oriented and are deleted.


NO1(up1(x)) -> NO1(x)
The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
NO1(x1)  =  NO1(x1)
up1(x1)  =  up1(x1)

Lexicographic Path Order [19].
Precedence:
up1 > NO1


The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ QDPOrderProof
QDP
                ↳ PisEmptyProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

rec1(rec1(x)) -> sent1(rec1(x))
rec1(sent1(x)) -> sent1(rec1(x))
rec1(no1(x)) -> sent1(rec1(x))
rec1(bot) -> up1(sent1(bot))
rec1(up1(x)) -> up1(rec1(x))
sent1(up1(x)) -> up1(sent1(x))
no1(up1(x)) -> up1(no1(x))
top1(rec1(up1(x))) -> top1(check1(rec1(x)))
top1(sent1(up1(x))) -> top1(check1(rec1(x)))
top1(no1(up1(x))) -> top1(check1(rec1(x)))
check1(up1(x)) -> up1(check1(x))
check1(sent1(x)) -> sent1(check1(x))
check1(rec1(x)) -> rec1(check1(x))
check1(no1(x)) -> no1(check1(x))
check1(no1(x)) -> no1(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
QDP
            ↳ QDPOrderProof
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

SENT1(up1(x)) -> SENT1(x)

The TRS R consists of the following rules:

rec1(rec1(x)) -> sent1(rec1(x))
rec1(sent1(x)) -> sent1(rec1(x))
rec1(no1(x)) -> sent1(rec1(x))
rec1(bot) -> up1(sent1(bot))
rec1(up1(x)) -> up1(rec1(x))
sent1(up1(x)) -> up1(sent1(x))
no1(up1(x)) -> up1(no1(x))
top1(rec1(up1(x))) -> top1(check1(rec1(x)))
top1(sent1(up1(x))) -> top1(check1(rec1(x)))
top1(no1(up1(x))) -> top1(check1(rec1(x)))
check1(up1(x)) -> up1(check1(x))
check1(sent1(x)) -> sent1(check1(x))
check1(rec1(x)) -> rec1(check1(x))
check1(no1(x)) -> no1(check1(x))
check1(no1(x)) -> no1(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be strictly oriented and are deleted.


SENT1(up1(x)) -> SENT1(x)
The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
SENT1(x1)  =  SENT1(x1)
up1(x1)  =  up1(x1)

Lexicographic Path Order [19].
Precedence:
up1 > SENT1


The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
QDP
                ↳ PisEmptyProof
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

rec1(rec1(x)) -> sent1(rec1(x))
rec1(sent1(x)) -> sent1(rec1(x))
rec1(no1(x)) -> sent1(rec1(x))
rec1(bot) -> up1(sent1(bot))
rec1(up1(x)) -> up1(rec1(x))
sent1(up1(x)) -> up1(sent1(x))
no1(up1(x)) -> up1(no1(x))
top1(rec1(up1(x))) -> top1(check1(rec1(x)))
top1(sent1(up1(x))) -> top1(check1(rec1(x)))
top1(no1(up1(x))) -> top1(check1(rec1(x)))
check1(up1(x)) -> up1(check1(x))
check1(sent1(x)) -> sent1(check1(x))
check1(rec1(x)) -> rec1(check1(x))
check1(no1(x)) -> no1(check1(x))
check1(no1(x)) -> no1(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
QDP
            ↳ QDPOrderProof
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

REC1(up1(x)) -> REC1(x)
REC1(no1(x)) -> REC1(x)
REC1(sent1(x)) -> REC1(x)

The TRS R consists of the following rules:

rec1(rec1(x)) -> sent1(rec1(x))
rec1(sent1(x)) -> sent1(rec1(x))
rec1(no1(x)) -> sent1(rec1(x))
rec1(bot) -> up1(sent1(bot))
rec1(up1(x)) -> up1(rec1(x))
sent1(up1(x)) -> up1(sent1(x))
no1(up1(x)) -> up1(no1(x))
top1(rec1(up1(x))) -> top1(check1(rec1(x)))
top1(sent1(up1(x))) -> top1(check1(rec1(x)))
top1(no1(up1(x))) -> top1(check1(rec1(x)))
check1(up1(x)) -> up1(check1(x))
check1(sent1(x)) -> sent1(check1(x))
check1(rec1(x)) -> rec1(check1(x))
check1(no1(x)) -> no1(check1(x))
check1(no1(x)) -> no1(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be strictly oriented and are deleted.


REC1(no1(x)) -> REC1(x)
The remaining pairs can at least by weakly be oriented.

REC1(up1(x)) -> REC1(x)
REC1(sent1(x)) -> REC1(x)
Used ordering: Combined order from the following AFS and order.
REC1(x1)  =  REC1(x1)
up1(x1)  =  x1
no1(x1)  =  no1(x1)
sent1(x1)  =  x1

Lexicographic Path Order [19].
Precedence:
[REC1, no1]


The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
QDP
                ↳ QDPOrderProof
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

REC1(up1(x)) -> REC1(x)
REC1(sent1(x)) -> REC1(x)

The TRS R consists of the following rules:

rec1(rec1(x)) -> sent1(rec1(x))
rec1(sent1(x)) -> sent1(rec1(x))
rec1(no1(x)) -> sent1(rec1(x))
rec1(bot) -> up1(sent1(bot))
rec1(up1(x)) -> up1(rec1(x))
sent1(up1(x)) -> up1(sent1(x))
no1(up1(x)) -> up1(no1(x))
top1(rec1(up1(x))) -> top1(check1(rec1(x)))
top1(sent1(up1(x))) -> top1(check1(rec1(x)))
top1(no1(up1(x))) -> top1(check1(rec1(x)))
check1(up1(x)) -> up1(check1(x))
check1(sent1(x)) -> sent1(check1(x))
check1(rec1(x)) -> rec1(check1(x))
check1(no1(x)) -> no1(check1(x))
check1(no1(x)) -> no1(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be strictly oriented and are deleted.


REC1(sent1(x)) -> REC1(x)
The remaining pairs can at least by weakly be oriented.

REC1(up1(x)) -> REC1(x)
Used ordering: Combined order from the following AFS and order.
REC1(x1)  =  REC1(x1)
up1(x1)  =  x1
sent1(x1)  =  sent1(x1)

Lexicographic Path Order [19].
Precedence:
trivial


The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ QDPOrderProof
QDP
                    ↳ QDPOrderProof
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

REC1(up1(x)) -> REC1(x)

The TRS R consists of the following rules:

rec1(rec1(x)) -> sent1(rec1(x))
rec1(sent1(x)) -> sent1(rec1(x))
rec1(no1(x)) -> sent1(rec1(x))
rec1(bot) -> up1(sent1(bot))
rec1(up1(x)) -> up1(rec1(x))
sent1(up1(x)) -> up1(sent1(x))
no1(up1(x)) -> up1(no1(x))
top1(rec1(up1(x))) -> top1(check1(rec1(x)))
top1(sent1(up1(x))) -> top1(check1(rec1(x)))
top1(no1(up1(x))) -> top1(check1(rec1(x)))
check1(up1(x)) -> up1(check1(x))
check1(sent1(x)) -> sent1(check1(x))
check1(rec1(x)) -> rec1(check1(x))
check1(no1(x)) -> no1(check1(x))
check1(no1(x)) -> no1(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be strictly oriented and are deleted.


REC1(up1(x)) -> REC1(x)
The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
REC1(x1)  =  REC1(x1)
up1(x1)  =  up1(x1)

Lexicographic Path Order [19].
Precedence:
up1 > REC1


The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ QDPOrderProof
                  ↳ QDP
                    ↳ QDPOrderProof
QDP
                        ↳ PisEmptyProof
          ↳ QDP
          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

rec1(rec1(x)) -> sent1(rec1(x))
rec1(sent1(x)) -> sent1(rec1(x))
rec1(no1(x)) -> sent1(rec1(x))
rec1(bot) -> up1(sent1(bot))
rec1(up1(x)) -> up1(rec1(x))
sent1(up1(x)) -> up1(sent1(x))
no1(up1(x)) -> up1(no1(x))
top1(rec1(up1(x))) -> top1(check1(rec1(x)))
top1(sent1(up1(x))) -> top1(check1(rec1(x)))
top1(no1(up1(x))) -> top1(check1(rec1(x)))
check1(up1(x)) -> up1(check1(x))
check1(sent1(x)) -> sent1(check1(x))
check1(rec1(x)) -> rec1(check1(x))
check1(no1(x)) -> no1(check1(x))
check1(no1(x)) -> no1(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
QDP
            ↳ QDPOrderProof
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

CHECK1(no1(x)) -> CHECK1(x)
CHECK1(up1(x)) -> CHECK1(x)
CHECK1(sent1(x)) -> CHECK1(x)
CHECK1(rec1(x)) -> CHECK1(x)

The TRS R consists of the following rules:

rec1(rec1(x)) -> sent1(rec1(x))
rec1(sent1(x)) -> sent1(rec1(x))
rec1(no1(x)) -> sent1(rec1(x))
rec1(bot) -> up1(sent1(bot))
rec1(up1(x)) -> up1(rec1(x))
sent1(up1(x)) -> up1(sent1(x))
no1(up1(x)) -> up1(no1(x))
top1(rec1(up1(x))) -> top1(check1(rec1(x)))
top1(sent1(up1(x))) -> top1(check1(rec1(x)))
top1(no1(up1(x))) -> top1(check1(rec1(x)))
check1(up1(x)) -> up1(check1(x))
check1(sent1(x)) -> sent1(check1(x))
check1(rec1(x)) -> rec1(check1(x))
check1(no1(x)) -> no1(check1(x))
check1(no1(x)) -> no1(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be strictly oriented and are deleted.


CHECK1(up1(x)) -> CHECK1(x)
The remaining pairs can at least by weakly be oriented.

CHECK1(no1(x)) -> CHECK1(x)
CHECK1(sent1(x)) -> CHECK1(x)
CHECK1(rec1(x)) -> CHECK1(x)
Used ordering: Combined order from the following AFS and order.
CHECK1(x1)  =  CHECK1(x1)
no1(x1)  =  x1
up1(x1)  =  up1(x1)
sent1(x1)  =  x1
rec1(x1)  =  x1

Lexicographic Path Order [19].
Precedence:
trivial


The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
QDP
                ↳ QDPOrderProof
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

CHECK1(no1(x)) -> CHECK1(x)
CHECK1(sent1(x)) -> CHECK1(x)
CHECK1(rec1(x)) -> CHECK1(x)

The TRS R consists of the following rules:

rec1(rec1(x)) -> sent1(rec1(x))
rec1(sent1(x)) -> sent1(rec1(x))
rec1(no1(x)) -> sent1(rec1(x))
rec1(bot) -> up1(sent1(bot))
rec1(up1(x)) -> up1(rec1(x))
sent1(up1(x)) -> up1(sent1(x))
no1(up1(x)) -> up1(no1(x))
top1(rec1(up1(x))) -> top1(check1(rec1(x)))
top1(sent1(up1(x))) -> top1(check1(rec1(x)))
top1(no1(up1(x))) -> top1(check1(rec1(x)))
check1(up1(x)) -> up1(check1(x))
check1(sent1(x)) -> sent1(check1(x))
check1(rec1(x)) -> rec1(check1(x))
check1(no1(x)) -> no1(check1(x))
check1(no1(x)) -> no1(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be strictly oriented and are deleted.


CHECK1(sent1(x)) -> CHECK1(x)
The remaining pairs can at least by weakly be oriented.

CHECK1(no1(x)) -> CHECK1(x)
CHECK1(rec1(x)) -> CHECK1(x)
Used ordering: Combined order from the following AFS and order.
CHECK1(x1)  =  CHECK1(x1)
no1(x1)  =  x1
sent1(x1)  =  sent1(x1)
rec1(x1)  =  x1

Lexicographic Path Order [19].
Precedence:
[CHECK1, sent1]


The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ QDPOrderProof
QDP
                    ↳ QDPOrderProof
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

CHECK1(no1(x)) -> CHECK1(x)
CHECK1(rec1(x)) -> CHECK1(x)

The TRS R consists of the following rules:

rec1(rec1(x)) -> sent1(rec1(x))
rec1(sent1(x)) -> sent1(rec1(x))
rec1(no1(x)) -> sent1(rec1(x))
rec1(bot) -> up1(sent1(bot))
rec1(up1(x)) -> up1(rec1(x))
sent1(up1(x)) -> up1(sent1(x))
no1(up1(x)) -> up1(no1(x))
top1(rec1(up1(x))) -> top1(check1(rec1(x)))
top1(sent1(up1(x))) -> top1(check1(rec1(x)))
top1(no1(up1(x))) -> top1(check1(rec1(x)))
check1(up1(x)) -> up1(check1(x))
check1(sent1(x)) -> sent1(check1(x))
check1(rec1(x)) -> rec1(check1(x))
check1(no1(x)) -> no1(check1(x))
check1(no1(x)) -> no1(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be strictly oriented and are deleted.


CHECK1(rec1(x)) -> CHECK1(x)
The remaining pairs can at least by weakly be oriented.

CHECK1(no1(x)) -> CHECK1(x)
Used ordering: Combined order from the following AFS and order.
CHECK1(x1)  =  CHECK1(x1)
no1(x1)  =  x1
rec1(x1)  =  rec1(x1)

Lexicographic Path Order [19].
Precedence:
trivial


The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ QDPOrderProof
                  ↳ QDP
                    ↳ QDPOrderProof
QDP
                        ↳ QDPOrderProof
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

CHECK1(no1(x)) -> CHECK1(x)

The TRS R consists of the following rules:

rec1(rec1(x)) -> sent1(rec1(x))
rec1(sent1(x)) -> sent1(rec1(x))
rec1(no1(x)) -> sent1(rec1(x))
rec1(bot) -> up1(sent1(bot))
rec1(up1(x)) -> up1(rec1(x))
sent1(up1(x)) -> up1(sent1(x))
no1(up1(x)) -> up1(no1(x))
top1(rec1(up1(x))) -> top1(check1(rec1(x)))
top1(sent1(up1(x))) -> top1(check1(rec1(x)))
top1(no1(up1(x))) -> top1(check1(rec1(x)))
check1(up1(x)) -> up1(check1(x))
check1(sent1(x)) -> sent1(check1(x))
check1(rec1(x)) -> rec1(check1(x))
check1(no1(x)) -> no1(check1(x))
check1(no1(x)) -> no1(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be strictly oriented and are deleted.


CHECK1(no1(x)) -> CHECK1(x)
The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
CHECK1(x1)  =  CHECK1(x1)
no1(x1)  =  no1(x1)

Lexicographic Path Order [19].
Precedence:
no1 > CHECK1


The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ QDPOrderProof
                  ↳ QDP
                    ↳ QDPOrderProof
                      ↳ QDP
                        ↳ QDPOrderProof
QDP
                            ↳ PisEmptyProof
          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

rec1(rec1(x)) -> sent1(rec1(x))
rec1(sent1(x)) -> sent1(rec1(x))
rec1(no1(x)) -> sent1(rec1(x))
rec1(bot) -> up1(sent1(bot))
rec1(up1(x)) -> up1(rec1(x))
sent1(up1(x)) -> up1(sent1(x))
no1(up1(x)) -> up1(no1(x))
top1(rec1(up1(x))) -> top1(check1(rec1(x)))
top1(sent1(up1(x))) -> top1(check1(rec1(x)))
top1(no1(up1(x))) -> top1(check1(rec1(x)))
check1(up1(x)) -> up1(check1(x))
check1(sent1(x)) -> sent1(check1(x))
check1(rec1(x)) -> rec1(check1(x))
check1(no1(x)) -> no1(check1(x))
check1(no1(x)) -> no1(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
QDP
            ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

TOP1(no1(up1(x))) -> TOP1(check1(rec1(x)))
TOP1(sent1(up1(x))) -> TOP1(check1(rec1(x)))
TOP1(rec1(up1(x))) -> TOP1(check1(rec1(x)))

The TRS R consists of the following rules:

rec1(rec1(x)) -> sent1(rec1(x))
rec1(sent1(x)) -> sent1(rec1(x))
rec1(no1(x)) -> sent1(rec1(x))
rec1(bot) -> up1(sent1(bot))
rec1(up1(x)) -> up1(rec1(x))
sent1(up1(x)) -> up1(sent1(x))
no1(up1(x)) -> up1(no1(x))
top1(rec1(up1(x))) -> top1(check1(rec1(x)))
top1(sent1(up1(x))) -> top1(check1(rec1(x)))
top1(no1(up1(x))) -> top1(check1(rec1(x)))
check1(up1(x)) -> up1(check1(x))
check1(sent1(x)) -> sent1(check1(x))
check1(rec1(x)) -> rec1(check1(x))
check1(no1(x)) -> no1(check1(x))
check1(no1(x)) -> no1(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be strictly oriented and are deleted.


TOP1(rec1(up1(x))) -> TOP1(check1(rec1(x)))
The remaining pairs can at least by weakly be oriented.

TOP1(no1(up1(x))) -> TOP1(check1(rec1(x)))
TOP1(sent1(up1(x))) -> TOP1(check1(rec1(x)))
Used ordering: Combined order from the following AFS and order.
TOP1(x1)  =  TOP1(x1)
no1(x1)  =  x1
up1(x1)  =  up1(x1)
check1(x1)  =  x1
rec1(x1)  =  rec1(x1)
sent1(x1)  =  x1
bot  =  bot

Lexicographic Path Order [19].
Precedence:
TOP1 > [up1, rec1] > bot


The following usable rules [14] were oriented:

rec1(rec1(x)) -> sent1(rec1(x))
rec1(sent1(x)) -> sent1(rec1(x))
rec1(no1(x)) -> sent1(rec1(x))
rec1(bot) -> up1(sent1(bot))
rec1(up1(x)) -> up1(rec1(x))
check1(up1(x)) -> up1(check1(x))
check1(sent1(x)) -> sent1(check1(x))
check1(rec1(x)) -> rec1(check1(x))
check1(no1(x)) -> no1(check1(x))
check1(no1(x)) -> no1(x)
no1(up1(x)) -> up1(no1(x))
sent1(up1(x)) -> up1(sent1(x))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
QDP
                ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

TOP1(no1(up1(x))) -> TOP1(check1(rec1(x)))
TOP1(sent1(up1(x))) -> TOP1(check1(rec1(x)))

The TRS R consists of the following rules:

rec1(rec1(x)) -> sent1(rec1(x))
rec1(sent1(x)) -> sent1(rec1(x))
rec1(no1(x)) -> sent1(rec1(x))
rec1(bot) -> up1(sent1(bot))
rec1(up1(x)) -> up1(rec1(x))
sent1(up1(x)) -> up1(sent1(x))
no1(up1(x)) -> up1(no1(x))
top1(rec1(up1(x))) -> top1(check1(rec1(x)))
top1(sent1(up1(x))) -> top1(check1(rec1(x)))
top1(no1(up1(x))) -> top1(check1(rec1(x)))
check1(up1(x)) -> up1(check1(x))
check1(sent1(x)) -> sent1(check1(x))
check1(rec1(x)) -> rec1(check1(x))
check1(no1(x)) -> no1(check1(x))
check1(no1(x)) -> no1(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be strictly oriented and are deleted.


TOP1(no1(up1(x))) -> TOP1(check1(rec1(x)))
The remaining pairs can at least by weakly be oriented.

TOP1(sent1(up1(x))) -> TOP1(check1(rec1(x)))
Used ordering: Combined order from the following AFS and order.
TOP1(x1)  =  x1
no1(x1)  =  no1(x1)
up1(x1)  =  up1(x1)
check1(x1)  =  x1
rec1(x1)  =  rec1(x1)
sent1(x1)  =  x1
bot  =  bot

Lexicographic Path Order [19].
Precedence:
no1 > [up1, rec1]
bot > [up1, rec1]


The following usable rules [14] were oriented:

rec1(rec1(x)) -> sent1(rec1(x))
rec1(sent1(x)) -> sent1(rec1(x))
rec1(no1(x)) -> sent1(rec1(x))
rec1(bot) -> up1(sent1(bot))
rec1(up1(x)) -> up1(rec1(x))
check1(up1(x)) -> up1(check1(x))
check1(sent1(x)) -> sent1(check1(x))
check1(rec1(x)) -> rec1(check1(x))
check1(no1(x)) -> no1(check1(x))
check1(no1(x)) -> no1(x)
no1(up1(x)) -> up1(no1(x))
sent1(up1(x)) -> up1(sent1(x))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ QDPOrderProof
QDP

Q DP problem:
The TRS P consists of the following rules:

TOP1(sent1(up1(x))) -> TOP1(check1(rec1(x)))

The TRS R consists of the following rules:

rec1(rec1(x)) -> sent1(rec1(x))
rec1(sent1(x)) -> sent1(rec1(x))
rec1(no1(x)) -> sent1(rec1(x))
rec1(bot) -> up1(sent1(bot))
rec1(up1(x)) -> up1(rec1(x))
sent1(up1(x)) -> up1(sent1(x))
no1(up1(x)) -> up1(no1(x))
top1(rec1(up1(x))) -> top1(check1(rec1(x)))
top1(sent1(up1(x))) -> top1(check1(rec1(x)))
top1(no1(up1(x))) -> top1(check1(rec1(x)))
check1(up1(x)) -> up1(check1(x))
check1(sent1(x)) -> sent1(check1(x))
check1(rec1(x)) -> rec1(check1(x))
check1(no1(x)) -> no1(check1(x))
check1(no1(x)) -> no1(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.